Cluster consensus on matrix-weighted switching networks

This paper examines cluster consensus for multi-agent systems on matrix-weighted switching networks. Necessary and/or sufficient conditions under which can be achieved are obtained, as well quantitative characterization of the steady-state consensus. Specifically, when underlying network switches amongst a finite number networks, necessary condition networks is derived; moreover, it shown that nodes lies at intersection null spaces matrix-valued Laplacians corresponding Furthermore, an infinite integral employed to provide consensus; analogous previous case, pertains space analysis Laplacian “integral” network. Lastly, bipartite provided. Simulation examples demonstrate presented theoretical results.